The Deductive Database System LOLA
نویسندگان
چکیده
منابع مشابه
O!-LOLA - Extending the Deductive Database System LOLA by Object-Oriented Logic Programming
This paper presents the declarative extension of the deductive database system LOLA to the object-oriented deductive database system O!-LOLA. The model used for O!-LOLA is \objects as theories", extended by state evolution. O!-LOLA combines logic programming and OO programming in two diierent w ays: First, methods are implemented as logic programs. These methods can be inherited, encapsulated a...
متن کاملLOLA - A Logic Language for Deductive Databases and its Implementation
The purpose of this paper is to give an overview of the LOLA logic programming system which serves as the kernel of a deductive database system. The LOLA language, the query evaluation strategy, the available query optimiaations, the overall compiler architecture, and some implementational details and performance measurements are presented. The LOLA-system is fully implemented in Common Lisp an...
متن کاملAMOS: A Natural Language Parser Implemented as a Deductive Database in LOLA
In this paper we present the set-oriented bottom-up parsing system AMOS which is a major application of the deductive database system LOLA. AMOS supports the morpho-syntactical analysis of old Hebrew and has now been operationally used by linguists for a couple of years. The system allows the declarative specification of Definite Clause Grammar rules. Due to the set-oriented bottom-up evaluatio...
متن کاملDesign and Implementation of the Relationlog Deductive Database System
We describe the design and implementation of Relationlog, a persistent deductive database system. Unlike other related systems such as Aditi, CORAL, LDL, LOLA and Nail-Glue, Relationlog supports effective storage, efficient access and inference of large amounts of data with complex structures and provides declarative query language that can define recursive views involving complex data and also...
متن کاملGenerating Explanation Trees even for Negations in Deductive DataBase Systems
Although there were enormous research efforts on explanation and debugging tools for Prolog in the last years, good tools for bottom-up evaluating logic programming systems are still missing, since the generation of the underlying proof trees matches several problems in presence of negation and recursion. This paper wants to fill the gap and presents a source-to-source transformation to compute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997